// Copyright (c) 2010, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
//     * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

// ---
// Author: Jeffrey Junfeng Pan (panjunfeng@gmail.com)

#include "common/logging.h"
#include "common/testutil.h"
#include "node.h"

namespace {

// See http://go/gunitprimer for an introduction to gUnit.

class NodeTest {
 protected:
  // Remove all of the functions below that you do not need.
  // See http://go/gunitfaq#CtorVsSetUp for when to use SetUp/TearDown.

  NodeTest() {
  }

  virtual ~NodeTest() {
  }

  virtual void SetUp() {
  }

  virtual void TearDown() {
  }

  // Objects declared here can be used by all TEST_Fs in the test case for
  // Node.
  // See http://go/gunitprimer#Test_Fixtures_Using_the_Same_Dat for details.
};

TEST_F(NodeTest, SetAndGetNodeValueTest) {
  frequent_pattern_mining::Node* node;
  node = new frequent_pattern_mining::Node(-1);
  CHECK_EQ(-1, node->index());

  node->set_index(5);
  CHECK_EQ(5, node->index());

  node->set_frequency(10);
  CHECK_EQ(10, node->frequency());

  frequent_pattern_mining::Node* parent;
  parent = new frequent_pattern_mining::Node(-2);
  node->set_parent(parent);
  parent->add_child(node);
  CHECK_EQ(parent, node->parent());

  CHECK_EQ(0, node->children().size());
  frequent_pattern_mining::Node* child;
  child = new frequent_pattern_mining::Node(1);
  node->add_child(child);
  CHECK_EQ(1, node->children().size());
  CHECK_EQ(1, node->children()[0]->index());

  frequent_pattern_mining::Node* sibling;
  sibling = new frequent_pattern_mining::Node(1);
  node->add_child(sibling);
  sibling->set_header_next(child);
  CHECK_EQ(2, node->children().size());
  CHECK_EQ(1, node->children()[1]->index());
  CHECK_EQ(node->children()[0], node->children()[1]->header_next());

  delete parent;  // all the sub-tree memory will be released recursively.
}

}  // namespace

int main(int argc, char **argv) {
  return 0;
}
